Contribution to Transfer Entropy Estimation via the k-Nearest-Neighbors Approach
نویسندگان
چکیده
منابع مشابه
Contribution to Transfer Entropy Estimation via the k-Nearest-Neighbors Approach
This paper deals with the estimation of transfer entropy based on the k-nearest neighbors (k-NN) method. To this end, we first investigate the estimation of Shannon entropy involving a rectangular neighboring region, as suggested in already existing literature, and develop two kinds of entropy estimators. Then, applying the widely-used error cancellation approach to these entropy estimators, we...
متن کاملEnsemble Estimation of Distributional Functionals via $k$-Nearest Neighbors
The problem of accurate nonparametric estimation of distributional functionals (integral functionals of one or more probability distributions) has received recent interest due to their wide applicability in signal processing, information theory, machine learning, and statistics. In particular, k-nearest neighbor (nn) based methods have received a lot of attention due to their adaptive nature an...
متن کاملEfficient multivariate entropy estimation via k-nearest neighbour distances
Many statistical procedures, including goodness-of-fit tests and methods for independent component analysis, rely critically on the estimation of the entropy of a distribution. In this paper, we seek entropy estimators that are efficient in the sense of achieving the local asymptotic minimax lower bound. To this end, we initially study a generalisation of the estimator originally proposed by Ko...
متن کاملComparing distance metrics for rotation using the k-nearest neighbors algorithm for entropy estimation
Distance metrics facilitate a number of methods for statistical analysis. For statistical mechanical applications, it is useful to be able to compute the distance between two different orientations of a molecule. However, a number of distance metrics for rotation have been employed, and in this study, we consider different distance metrics and their utility in entropy estimation using the k-nea...
متن کاملComputing the k Nearest-Neighbors for all Vertices via Dijkstra
We are given a directed graph G = (V,E) with n vertices and m edges, with positive weights on the edges, and a parameter k > 0. We show how to compute, for every vertex v ∈ V , its k nearest-neighbors. The algorithm runs in O(k(n log n + m)) time, and follows by a somewhat careful modification of Dijkstra’s shortest path algorithm. This result is probably folklore, but we were unable to find a ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Entropy
سال: 2015
ISSN: 1099-4300
DOI: 10.3390/e17064173